A Substitutional Framework for Arithmetical Validity
نویسنده
چکیده
A platonist in mathematics believes that arithmetic has a subject matter, i.e., that the statements of arithmetic are about certain objects – the natural numbers. For a platonist, the language of (first-order) arithmetic La is referential and he is licensed to speak of true and false sentences of La and to endorse Tarski’s analysis of truth. It follows from this Tarskian analysis plus the fact that every natural number is denoted by some closed term of La (a numeral, if one insists on canonicity) that the truth values of arithmetical sentences are determined by the truth values of its atomic sentences. Consider now a philosopher who, while not a platonist in any sense, broadly accepts the results of mathematics – however tentatively – and is persuaded that the truths of arithmetic are determined by the truth values of its atomic sentences (whatever may be his reformulation of the notion of arithmetical truth). This article may be viewed as an attempt to frame a position for such a non-platonist philosopher of a non-revisionist bent. It is well known that certain atomic sentences of arithmetic have a persuasive rendering in terms of schemata of formulas of first-order languages with equality. This rendering is specially persuasive insofar as we focus on the cardinal role of numbers (and leave their ordinal role aside). For instance, the sentence 7+5 =12 can be rendered as
منابع مشابه
The Substitutional Framework for Sorted Deduction
Researchers in artiicial intelligence have recently been taking great interest in hybrid representations , among them sorted logics|logics that link a traditional logical representation to a taxonomic (or sort) representation such as those prevalent in semantic networks. This paper introduces a general framework|the substitutional framework|for integrating logical deduction and sortal deduction...
متن کاملLogical Consequence Inside Out
Tarski’s definition of logical consequence for an interpreted language rests on the distinction between extra-logical symbols, whose interpretation is allowed to vary across models, and logical symbols, aka logical constants, whose interpretation remains fixed. In this perspective, logicality come first, and consequence is a byproduct of the division between logical and extra-logical symbols. O...
متن کاملTimothy Mccarthy Substitutional Quantification and Set Theory
Our concern in this paper is to defend the use of substitutional quantifi-. cation in set theory as a way of avoiding ontological commitment to sets. Specifically, two objections to this procedure are addressed. (1) Charles Parsons claims that substitutional quantification (at least in set theory) is not ontologically neutral, but rather expresses a bona fide sense of existence-l We argue that ...
متن کاملInterpreting the Validity of a High-Stakes Test in Light of the Argument-Based Framework: Implications for Test Improvement
The validity of large-scale assessments may be compromised, partly due to their content inappropriateness or construct underrepresentation. Few validity studies have focused on such assessments within an argument-based framework. This study analyzed the domain description and evaluation inference of the Ph.D. Entrance Exam of ELT (PEEE) sat by Ph.D. examinees (n = 999) in 2014 in Iran....
متن کاملArithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiable sentences. This paper is a contribution to the general study of this problem. We propose the classes of first-order core and ∆-core fuzzy logics as a good framework to address these arithmetical complexity issues. We ...
متن کامل